Measuring Complexity of Component Based System Using Weighted Assignment Technique
نویسندگان
چکیده
Abstract. Component based software engineering advocates acquisition, variation and integration of reusable software components to rapidly develop complex systems with minimum effort and cost. Components are essential part of component based software development. Researchers are striving hard to identify metrics that help in estimating complexity of component based system. Interactions /interfaces among components play a major role in contributing complexity to a component based system. In this paper, we have proposed two metrics for measuring complexity of interface and interface dependency of component based system. These metrics are based on different constituents of an interface like interface methods and instance variables with different weights assigned to them. These interfaces can be represented by adjacency matrix used in graph theory. Strength of proposed metrics is computed using weighted assignment technique. Empirical evaluation is done using a case study. The metrics are also validated on Java Beans. Result of present study is quite encouraging and may further help in estimating complexity of components.
منابع مشابه
On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملدر کاربرد تشخیص زبان گفتاری GMM-VSM در قالب سیستم GMM
GMM is one of the most successful models in the field of automatic language identification. In this paper we have proposed a new model named adapted weight GMM (AW-GMM). This model is similar to GMM but the weights are determined using GMM-VSM LID system based on the power of each component in discriminating one language from the others. Also considering the computational complexity of GMM-VSM,...
متن کاملA New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
متن کاملLow Complexity and High speed in Leading DCD ERLS Algorithm
Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...
متن کاملEvaluating and Certifying Component-Based Software Using Weighted Assignment Technique
Certification refers to the verification of definite feature of an object, person, or an organization. This verification is often, but not always, provided by some form of external review, education, assessment, or audit. In general, the main certification idea is to bring quality process to a certain software product. One of the core goals to achieve quality in component based product is to ac...
متن کامل